2-Compromise Usability in 1-Dimensional Statistical Databases

Statistical database security is an important problem that has major implications for privacy and protection in the computerised, online world. In this paper we prove that the bounds on the number of answerable range queries in a 1-dimensional statistical database of size n for n odd, or n even and greater than 52, derived in [4] in fact hold for all n except for n = 12, and are achievable using two threads.